Algorithms for Multi-exponentiation
نویسنده
چکیده
This paper compares different approaches for computing power products ∏ 1≤i≤k g ei i in commutative groups. We look at the conventional simultaneous exponentiation approach and present an alternative strategy, interleaving exponentiation. Our comparison shows that in general groups, sometimes the conventional method and sometimes interleaving exponentiation is more efficient. In groups where inverting elements is easy (e.g. elliptic curves), interleaving exponentiation with signed exponent recoding usually wins over the conventional method.
منابع مشابه
Efficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملHigh-speed Algorithms for Public-key Cryptosystems in an e-Commerce Environment
Modular exponentiation is one of the most important operations in public-key cryptosystems. A modular exponentiation is composed of repetition of modular multiplications. Again, the modular multiplication consists of a multi-precision multiplication and a modular reduction. Therefore, we can reduce the execution time of the modular exponentiation by two methods. One is to reduce the number of m...
متن کاملOn multi-exponentiation in cryptography
We describe and analyze new combinations of multi-exponentiation algorithms with representations of the exponents. We deal mainly but not exclusively with the case where the inversion of group elements is fast: This is true for example for elliptic curves, groups of rational divisor classes of hyperelliptic curves, trace zero varieties and XTR. These methods are most attractive with exponents i...
متن کاملEfficient Left-to-Right Multi-Exponentiations
Multi-exponent algorithms are frequently used in cryptographic protocols, for example, digital signature algorithms, some commitment schemes, etc. The previously known efficient algorithms use special exponent recording algorithms like wNAF or the joint sparse form. Those algorithms can only be applied starting at the least significant bit. Therefore, they require additional memory for the reco...
متن کاملA Novel Multi Exponentiation Method
The efficiency and security of most elliptic curve cryptosystems are based on multi exponentiation, such as the verification process in elliptic curve digital signature algorithm. Simultaneous methods are considered to be the most efficient for multi exponentiation. In this paper, we propose a method to construct an addition chain for simultaneous multi exponentiation, which has never been cons...
متن کامل